Processing Structured Input with Skipping Nested Automata
نویسندگان
چکیده
We propose a new kind of finite-state automata, suitable for structured input characters corresponding to unranked trees of small depth. As a motivating application, we regard executing morphosyntactic queries on a richly annotated text corpus.
منابع مشابه
Symbolic Visibly Pushdown Automata
Nested words model data with both linear and hierarchical structure such as XML documents and program traces. A nested word is a sequence of positions together with a matching relation that connects open tags (calls) with the corresponding close tags (returns). Visibly Pushdown Automata are a restricted class of pushdown automata that process nested words, and have many appealing theoretical pr...
متن کاملSublinear Matching With Finite Automata Using Reverse Suffix Scanning
We give algorithms to accelerate the computation of deterministic finite automata (DFA) by calculating the state of a DFA n positions ahead utilizing a reverse scan of the next n characters. Often this requires scanning fewer than n characters resulting in a fraction of the input being skipped and a commensurate increase in processing speed. The skipped fraction is > 80% in several of our examp...
متن کاملThe Impact of Learning Styles on the Iranian EFL Learners' Input Processing
This research study explored the impact of learning styles and input modalities on the second language (L2) learners' input processing (IP). This study also sought to appraise the usefulness of Processing Instruction (PI) and its components in relation to the learners' learning styles and input modalities. To this end, 73 male and female Iranian EFL learners from Islamic Azad University, North ...
متن کاملComplexity of Input-Driven Pushdown Automata1
In an input-driven pushdown automaton (IDPDA), the current input symbol determines whether the automaton performs a push operation, a pop operation, or does not touch the stack. Inputdriven pushdown automata, also known under alternative names of visibly pushdown automata and of nested word automata, have been intensively studied because of their desirable features: for instance, the model allo...
متن کاملNested Weighted Limit-Average Automata of Bounded Width
While weighted automata provide a natural framework to express quantitative properties, many basic properties like average response time cannot be expressed with weighted automata. Nested weighted automata extend weighted automata and consist of a master automaton and a set of slave automata that are invoked by the master automaton. Nested weighted automata are strictly more expressive than wei...
متن کامل